Optimal Wire and Transistor Sizing for Circuits with Non-Tree Topology1
نویسندگان
چکیده
Conventional methods for optimal sizing of wires and transistors use linear RC circuit models and the Elmore delay as a measure of signal delay. If the RC circuit has a tree topology the sizing problem reduces to a convex optimization problem which can be solved using geometric programming. The tree topology restriction precludes the use of these methods in several sizing problems of signi cant importance to high-performance deep submicron design including, for example, circuits with loops of resistors, e.g., clock distribution meshes, and circuits with coupling capacitors, e.g., buses with crosstalk between the lines. The paper proposes a new optimization method which can be used to address these problems. The method uses the dominant time constant as a measure of signal propagation delay in an RC circuit, instead of Elmore delay. Using this measure, sizing of any RC circuit can be cast as a convex optimization problem which can be solved using the recently developed e cient interior-point methods for semide nite programming. The method is applied to two important sizing problems | sizing of clock meshes, and sizing of buses in the presence of crosstalk.
منابع مشابه
Energy Consumption Optimization for Basic Arithmetic Circuits with Transistor Sizing Based on Genetic Algorithm
Transistor sizing is very important for determination of the circuit performance. As a result for providing fair evaluation, an optimal size of transistor is necessary. Genetic algorithm that is capable of reduction of search problem complexity uses the transistor sizing which is originally a kind of search problem in the large multidimensional search space for energy consumption optimization. ...
متن کاملOptimizing dominant time constant in RC circuits
We propose to use the dominant time constant of a resistor-capacitor (RC) circuit as a measure of the signal propagation delay through the circuit. We show that the dominant time constant is a quasiconvex function of the conductances and capacitances, and use this property to cast several interesting design problems as convex optimization problems, speci cally, semide nite programs (SDPs). For ...
متن کامل\an Exact Solution to the Transistor Siz- Ing Problem for Cmos Circuits Using Convex Optimization," Ieee Trans. on Computer-aided Design of Run Time (s) Pitch-spacing Min Giss/faf Giss/vaf Lr-based Giss/vaf Lr-based 2 4.2 Wire Sizing and Spacing for Multiple Nets
\Optimal wire sizing and buuer insertion for low power and a generalized delay model," in Proc. 17 problems are solved in the context of simultaneous device and wire sizing optimization for deep submicron designs. Experiments show that our LR-based optimization algorithm is very eeective and extremely eecient. Up to 16.5% delay reduction is observed when compared with previous work based on the...
متن کاملOptimal Wire-Sizing Formula Under the Elmore Delay Model
In this paper, we consider non-uniform wire-sizing. Given a wire segment of length L, let f(x) be the width of the wire at position x, 0 x L. We show that the optimal wire-sizing function that minimizes the Elmore delay through the wire is f(x) = ae ?bx , where a > 0 and b > 0 are constants that can be computed in O(1) time. In the case where lower bound (L > 0) and upper bound (U > 0) on the w...
متن کاملModeling and Layout Optimization of VLSI Devices and Interconnects In Deep Submicron Design
This paper presents an overview of recent advances on modeling and layout optimization of devices and interconnects for high-performance VLSI circuit design under the deep submicron technology. First, we review a number of interconnect and driver/gate delay models, which are most useful to guide the layout optimization. Then, we summarize the available performance optimization techniques for VL...
متن کامل